Conflict free colorings of (strongly) almost disjoint set-systems
نویسندگان
چکیده
منابع مشابه
Conflict Free Colorings of (strongly) Almost Disjoint Set-systems
f : ∪A → ρ is called a conflict free coloring of the set-system A (with ρ colors) if ∀A ∈ A ∃ ζ < ρ ( |A ∩ f−1{ζ}| = 1 ). The conflict free chromatic number χCF(A) of A is the smallest ρ for which A admits a conflict free coloring with ρ colors. A is a (λ, κ, μ)-system if |A| = λ, |A| = κ for all A ∈ A, and A is μ-almost disjoint, i.e. |A ∩ A′| < μ for distinct A,A′ ∈ A. Our aim here is to stud...
متن کاملConflict-free Colorings
Motivated by a frequency assignment problem in cellular telephone networks, Even et al. studied the following question. Given a set P of n points in general position in the plane, what is the smallest number of colors in a coloring of the elements of P with the property that any closed disk D with D ∩ P 6= ∅ has an element whose color is not assigned to any other element of D ∩ P . We refer to ...
متن کاملAlmost-disjoint Coding and Strongly Saturated Ideals
We show that Martin’s Axiom plus c = א2 implies that there is no (א2,א2,א0)-saturated σ-ideal on ω1. Given cardinals λ, κ and γ, a σ-ideal I on a set X is said to be (λ, κ, γ)-saturated if for every set {Aα : α < λ} ⊂ P(X) \ I there exists a set Y ∈ [λ] such that for all Z ∈ [Y ] , ⋂ {Aα : α ∈ Z} ∈ I. Laver [6] was the first to show the consistency of an (א2,א2,א0)-saturated ideal on ω1, using ...
متن کاملFault-Tolerant Conflict-Free Colorings
Background. Consider a cellular network consisting of a set of base stations, where the signal from a given base station can be received by clients within a certain distance from the base station. In general, these regions will overlap. For a client, this may lead to interference of the signals. Thus one would like to assign frequencies to the base stations such that for any client within reach...
متن کاملConflict-free colorings of graphs and hypergraphs
A coloring of the vertices of a hypergraph H is called conflict-free if each hyperedge E of H contains a vertex of “unique” color that does not get repeated in E. The smallest number of colors required for such a coloring is called the conflict-free chromatic number of H, and is denoted by χCF(H). This parameter was first introduced by Even et al. (FOCS 2002) in a geometric setting, in connecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica Hungarica
سال: 2010
ISSN: 0236-5294,1588-2632
DOI: 10.1007/s10474-010-0051-5